NAG Fortran Library Routine Document G08AGF
ثبت نشده
چکیده
The Wilcoxon one-sample signed rank test may be used to test whether a particular sample came from a population with a specified median. It is assumed that the population distribution is symmetric. The data consists of a single sample of n observations denoted by x1; x2; . . . ; xn. This sample may arise from the difference between pairs of observations from two matched samples of equal size taken from two populations, in which case the test may be used to test whether the median of the first population is the same as that of the second population. The hypothesis under test, H0, often called the null hypothesis, is that the median is equal to some given value ðXmedÞ, and this is to be tested against an alternative hypothesis H1 which is H1 : population median 61⁄4 Xmed; or H1 : population median > Xmed; or H1 : population median < Xmed, using a two-tailed, upper-tailed or lower-tailed probability respectively. The user selects the alternative hypothesis by choosing the appropriate tail probability to be computed (see the description of argument TAIL in Section 5). The Wilcoxon test differs from the Sign test (see G08AAF) in that the magnitude of the scores is taken into account, rather than simply the direction of such scores. The test procedure is as follows (a) For each xi, for i 1⁄4 1; 2; . . . ; n, the signed difference di 1⁄4 xi Xmed is found, where Xmed is a given test value for the median of the sample. (b) The absolute differences jdij are ranked with rank ri and any tied values of jdij are assigned the average of the tied ranks. The user may choose whether or not to ignore any cases where di 1⁄4 0 by removing them before or after ranking (see the description of the argument ZEROS in Section 5). (c) The number of non-zero di is found. (d) To each rank is affixed the sign of the di to which it corresponds. Let si 1⁄4 signðdiÞri. (e) The sum of the positive-signed ranks, W 1⁄4 X
منابع مشابه
NAG Fortran Library Routine Document E04MFF=E04MFA
Note: this routine uses optional parameters to define choices in the problem specification and in the details of the algorithm. If you wish to use default settings for all of the optional parameters, you need only read Section 1 to Section 9 of this document. Refer to the additional Section 10, Section 11 and Section 12 for a detailed description of the algorithm, the specification of the optio...
متن کاملNAG Fortran Library Routine Document E04NKF=E04NKA
Note: this routine uses optional parameters to define choices in the problem specification and in the details of the algorithm. If you wish to use default settings for all of the optional parameters, you need only read Section 1 to Section 9 of this document. Refer to the additional Section 10, Section 11 and Section 12 for a detailed description of the algorithm, the specification of the optio...
متن کاملNAG Fortran Library Routine Document E02BEF
where Ni x ð Þ denotes the normalized cubic B-spline defined upon the knots i; iþ1; . . . ; iþ4. The total number n of these knots and their values 1; . . . ; n are chosen automatically by the routine. The knots 5; . . . ; n 4 are the interior knots; they divide the approximation interval x1; xm 1⁄2 into n 7 subintervals. The coefficients c1; c2; . . . ; cn 4 are then determined as the solution...
متن کاملNAG Fortran Library Routine Document E02BAF
In order to define the full set of B-splines required, eight additional knots 1; 2; 3; 4 and nþ4; nþ5; nþ6; nþ7 are inserted automatically by the routine. The first four of these are set equal to the smallest xr and the last four to the largest xr. The representation of sðxÞ in terms of B-splines is the most compact form possible in that only nþ 3 coefficients, in addition to the nþ 7 knots, fu...
متن کاملNAG Fortran Library Routine Document C02AGF
The routine generates a sequence of iterates z1; z2; z3; . . ., such that jP ðzkþ1Þj < jP ðzkÞj and ensures that zkþ1 þ Lðzkþ1Þ ‘roughly’ lies inside a circular region of radius jF j about zk known to contain a zero of P ðzÞ; that is, jLðzkþ1Þj jF j, where F denotes the Féjer bound (see Marden (1966)) at the point zk. Following Smith (1967), F is taken to be minðB; 1:445nRÞ, where B is an upper...
متن کاملNAG Fortran Library Routine Document C06PPF
The transformed values ẑpk are complex, but for each value of p the ẑ p k form a Hermitian sequence (i.e., ẑpn k is the complex conjugate of ẑ p k), so they are completely determined by mn real numbers (since ẑ p 0 is real, as is ẑpn=2 for n even). Alternatively, given m Hermitian sequences of n complex data values zpj , this routine simultaneously calculates their inverse (backward) discrete F...
متن کامل